Slicing an Integrated Formal Method for Verification

نویسندگان

  • Ingo Brückner
  • Heike Wehrheim
چکیده

Model checking specifications with complex data and behaviour descriptions often fails due to the large state space to be processed. In this paper we propose a technique for reducing such specifications (with respect to certain properties under interest) before verification. The method is an adaption of the slicing technique from program analysis to the area of integrated formal notations and temporal logic properties. It solely operates on the syntactic structure of the specification which is usually significantly smaller than its state space. We show how to build a reduced specification via the construction of a so called program dependence graph, and prove correctness of the technique with respect to a projection relationship between full and reduced specification. The reduction thus preserves all properties formulated in temporal logics which are invariant under stuttering, as for instance LTL−X .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Model Slicing Method for Workflow Verification

Workflow systems increase productivity and quality of service; however, defects in a workflow model may have severe consequences. While model checking techniques can be used to verify the correctness of a workflow model, these techniques typically suffer from the state explosion problem. We propose a model slicing algorithm with a formal proof to address this problem. The algorithm is integrate...

متن کامل

Deductive Verification for Improving Slicing of Integrated Formal Specifications

The combination of the two well known formal specification techniques CSP [Hoa85] for behavioural aspects of systems and Object-Z (OZ) [Smi00] for data aspects of systems into the specification language CSPOZ [Fis97] has already been subject of intense research. An important challenge, especially when trying to automatically or semi-automatically analyse such specifications, is their inherent c...

متن کامل

A Proof Slicing Framework for Program Verification

In the context of program verification, we propose a formal framework for proof slicing that can aggressively reduce the size of proof obligations as a means of performance improvement. In particular, each large proof obligation may be broken down into smaller proofs, for which the overall processing cost can be greatly reduced, and be even more effective under proof caching. Our proposal is bu...

متن کامل

Conditioned Slicing for Efficient Multiway Decision Graphs Model-checker

Integrating formal verification techniques into the hardware design process provides the means to rigorously prove critical properties. However, most automatic verification techniques, such as model checking, are only effectively applicable to designs of limited sizes due to the state explosion problem. The Multiway Decision Graphs (MDG) method is an efficient method to define hardware designs ...

متن کامل

Static program transformations for efficient software model checking

Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checking suffers from the state space explosion problem. Abstraction is emerging as the key candidate for making the model checking problem tractable, and a large body of research exists on abstraction based verification. Many useful abstractions are p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005